منابع مشابه
The Machine Learning and Traveling Repairman Problem
The goal of the Machine Learning and Traveling Repairman Problem (ML&TRP) is to determine a route for a “repair crew,” which repairs nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, but the failure probabilities are not known and must be estimated. If there is uncertainty in the failure probability estimates, we take this uncertainty into account in an unusu...
متن کاملMachine Learning and the Traveling Repairman
The goal of the Machine Learning and Traveling Repairman Problem (ML&TRP) is to determine a route for a “repair crew,” which repairs nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, but as in many real situations, the failure probabilities are not known and must be estimated. If there is uncertainty in the failure probability estimates, we take this uncertai...
متن کاملLow-Cost Micro-Assembly Machine
Recently, production demand in manufacturing industries has changed drastically from demand for high-mix, low-volume production to that for high-mix, variable-volume production. At Fujitsu, we are promoting innovative engineering through the effective use of existing equipment without the need for additional investments and by implementing the Toyota Production System. Two major themes of manuf...
متن کاملLexical Micro-adaptation in Statistical Machine Translation
We introduce a generic framework in Statistical Machine Translation (SMT) in which lexical hypotheses, in the form of a target language model local to the input sentence, are used to guide the search for the best translation, thus performing a lexical microadaptation. An instantiation of this framework is presented and evaluated on three language pairs, where these auxiliary hypotheses are deri...
متن کاملPhrase-Based Statistical Machine Translation as a Traveling Salesman Problem
An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the famous Traveling Salesman Problem; in particular (Knight, 1999) has shown that any TSP instance can be mapped to a sub-case of a word-based SMT model, demonstrating NP-hardness of the decoding task. In this paper, we fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 1988
ISSN: 1882-675X,0912-0289
DOI: 10.2493/jjspe.54.1646